A Task Dependence Net Generator for Concurrent Ada Programs

نویسندگان

  • Yoshiaki Kasahara
  • Jingde Cheng
  • Kazuo Ushijima
چکیده

There are ve types of basic program dependences in concurrent programs. Task Dependence Net(TDN) is an arc-classi ed digraph to explicitly represent the ve types of basic program dependences in concurrent Ada programs. This paper describes algorithms to compute TDNs for a class of concurrent Ada programs, and shows the structure and implementation of our TDN generator for concurrent Ada programs based on these algorithms. The paper also discusses some applications of the TDN generator in development of concurrent Ada programs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A System Dependence Net Generator for Ada Programs

An explicit representation of various dependence relationship in a program has many application in software engineering. System Dependence Net is a model to represent program dependences in a concurrent program which consists of multiple procedures. This paper presents how to generate System Dependence Net for Ada 95 programs automatically.

متن کامل

An Approach to Slicing Concurrent Ada Programs Based on Program Reachability Graphs

Program slicing is an important technique applied in many software engineering activities, such as program debugging, testing, maintenance, measurement, reengineering and etc. This paper presents an effective representation for concurrent Ada programs, which is called task communication reachability graph (TCRG). Based on TCRG, we can precisely determine various dependences in concurrent Ada pr...

متن کامل

Verification in Concurrent Programming with Petri Nets Structural Techniques

This paper deals with verification of flow control in concurrent programs. We use Ada language model as reference. After translation of Ada programs into Petri nets (named Ada nets for Ada programs), we show how one can fully exploit the relationship between the behavior of the concurrent program and the structure of the corresponding Petri net. Using the siphon structure, we precise some struc...

متن کامل

Static Dependency Analysis for Concurrent Ada 95 Programs

Program dependency analysis is an analysis technique to identify and determine various program dependencies in program source codes. It is an important approach to testing, understanding, maintaining and transforming programs. But, there are still many difficulties to be solved when carrying out dependency analysis for concurrent programs because the execution of statements is unpredictable. In...

متن کامل

Automatic Translation of Ada-ECATNet Using Rewriting Logic

One major difficulty that faces developers of concurrent and distributed software is analysis for concurrency based faults like deadlocks. Petri nets are used extensively in the verification of correctness of concurrent programs. ECATNets are a category of algebraic Petri nets based on a sound combination of algebraic abstract types and high-level Petri nets. ECATNets have 'sound' and 'complete...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993